#include "stack.queue.h"

void test1()
{
	wyr::stack<int,list<int>> st;
	st.push(1);
	cout << st.top() << " ";
	st.push(2);
	cout << st.top() << " ";
	st.push(3);
	cout << st.top() << " ";
	st.push(4);
	cout << st.top() << " ";
	cout << st.size() << endl;
}

void test2()
{
	wyr::stack<int, vector<int>> st;
	st.push(1);
	cout << st.top() << " ";
	st.push(2);
	cout << st.top() << " ";
	st.push(3);
	cout << st.top() << " ";
	st.push(4);
	cout << st.top() << " ";
	cout << st.size() << endl;
}

void test3()
{
	deque<int> dq;
	dq.push_back(1);
	dq.push_back(2);
	dq.push_back(3);
	dq.push_back(4);
	dq.push_back(5);

	for (auto e : dq)
	{
		cout << e << " ";
	}
	cout << endl;
}
int main()
{
	test3();
	return 0;
}